Iterative Decoding of Superposition Coding

نویسنده

  • Jun Tong
چکیده

Clipping is applied to superposition coding systems to reduce the peak-to-average power ratio (PAPR) of the transmitted signal. The performance limit is investigated through evaluating the mutual information driven by the induced peak-power-limited input signals. It is shown that the channel capacity can be approached by clipped superposition coding systems. To alleviate the performance degradation due to clipping noises, we develop a soft compensation algorithm that is combined with soft-input-soft-output (SISO) decoding algorithms in an iterative manner. Simulation results show that with the proposed algorithm, most performance loss can be recovered.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Iterative SISO Strategy for MIMO Fading Channels

We propose a low complexity superposition coding approach to maximize the throughput of MIMO quasi-static fading channels. The MIMO channel is transformed to SISO channels using MMSE and an iterative decoding approach is proposed. The throughput of the proposed coding and decoding strategy may be less than the maximum possible.

متن کامل

Comdined Turbo Block Decoding and Equalisation

In this paper, the combination of equalization and turbo decoding is studied. In the iterative decoding of a product code in block turbo coding system, the equalization process is performed within the iteration loop. The present study aims to investigate the decision feedback equalizer (DFE) incorporated in the iterative decoding. Simulation results show that the more severe the channel interfe...

متن کامل

Comdined Turbo Block Decoding and Equalisation

In this paper, the combination of equalization and turbo decoding is studied. In the iterative decoding of a product code in block turbo coding system, the equalization process is performed within the iteration loop. The present study aims to investigate the decision feedback equalizer (DFE) incorporated in the iterative decoding. Simulation results show that the more severe the channel interfe...

متن کامل

Layered Subspace Codes for Network Coding

Subspace codes were introduced by Kötter and Kschischang for error control in random linear network coding. In this paper, a layered type of subspace codes is considered, which can be viewed as a superposition of multiple component subspace codes. Exploiting the layered structure, we develop two decoding algorithms for these codes. The first algorithm operates by separately decoding each compon...

متن کامل

Block Markov Superposition Transmission of BCH Codes with Iterative Erasures-and-Errors Decoders

In this paper, we present the block Markov superposition transmission of BCH (BMST-BCH) codes, which can be constructed to obtain a very low error floor. To reduce the implementation complexity, we design a low complexity iterative sliding-window decoding algorithm, in which only binary and/or erasure messages are processed and exchanged between processing units. The error floor can be predicte...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006